A New Algorithm for Computing the Determinant and the Inverse of a Pentadiagonal Toeplitz Matrix
نویسنده
چکیده
An effective numerical algorithm for computing the determinant of a pentadiagonal Toeplitz matrix has been proposed by Xiao-Guang Lv and others [1]. The complexity of the algorithm is (9n + 3). In this paper, a new algorithm with the cost of (4n + 6) is presented to compute the determinant of a pentadiagonal Toeplitz matrix. The inverse of a pentadiagonal Toeplitz matrix is also considered.
منابع مشابه
On the Inverse Problem of Constructing Symmetric Pentadiagonal Toeplitz Matrices from Three Largest Eigenvalues
The inverse problem of constructing a symmetric Toeplitz matrix with prescribed eigenvalues has been a challenge both theoretically and computationally in the literature. It is now known in theory that symmetric Toeplitz matrices can have arbitrary real spectra. This paper addresses a similar problem — Can the three largest eigenvalues of symmetric pentadiagonal Toeplitz matrices be arbitrary? ...
متن کاملSome Preconditioners for Block Pentadiagonal Linear Systems Based on New Approximate Factorization Methods
In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal linear systems suitable for vectors and parallel processors, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are appropriate when the desired target is to maximize parallelism. Moreover, some theoretical results about these pre...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملA STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT
The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...
متن کاملFast Algorithms with Preprocessing for Matrix-Vector Multiplication Problems
In this paper the problem of complexity o f m ultiplication of a matrix with a vector is studied for Toeplitz, Hankel, Vandermonde and Cauchy matrices and for matrices connected with them i.e. for transpose, inverse and transpose to inverse matrices. The proposed algorithms have complexities at most On log 2 n ops and in a number of cases improve the known estimates. In these algorithms, in a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013